منابع مشابه
Local Search and Backtracking vs Non-Systematic Backtracking
This paper addresses the following question: what is the essential difference between stochastic local search (LS) and systematic backtracking (BT) that gives LS superior scalability? One possibility is LS’s lack of firm commitment to any variable assignment. Three BT algorithms are modified to have this feature by introducing randomness into the choice of backtracking variable: a forward check...
متن کاملAn Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms
Consider an infinite binary search tree in which the branches have independent random costs. Suppose that we must find an optimal (cheapest) or nearly optimal path from the root to a node at depth n. Karp and Pearl [1983] show that a bounded-lookahead backtracking algorithm A2 usually finds a nearly optimal path in linear expected time (when the costs take only the values 0 or 1). From this suc...
متن کاملCommunity Detection with the Non-Backtracking Operator
Community detection consists in identification of groups of similar items within a population. In the context of online social networks, it is a useful primitive for recommending either contacts or news items to users. We will consider a particular generative probabilistic model for the observations, namely the so-called stochastic block model and prove that the non-backtracking operator provid...
متن کاملLocalized eigenvector of the non-backtracking matrix
Emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning. The spectral method using the non-backtracking matrix was proposed as a way to overcome this problem. The numerical experiments on several examples of real networks show that, indeed, the non-backtracking matrix does not exhibit localization of eigenvectors. We show that, however, localiz...
متن کاملNon-Systematic Backtracking for Mixed Integer Programs
A variety of hybrids of Constraint Programming, Artificial Intelligence and Operations Research techniques have given impressive results. Three recent approaches are (i) the use of relaxations in constraint systems, (ii) non-systematic backtracking to boost the scalability of constraint solvers, and (iii) non-systematic backtracking to boost the scalability of branch-and-bound search. This pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2019
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-019-00981-8